On decidability of concept satisfiability in Description Logic with product semantics

نویسندگان

چکیده

The aim of the present paper is to prove that concept validity and positive satisfiability with an empty ontology in Fuzzy Description Logic IALE, under standard product semantics respect quasi-witnessed models, are decidable. In our framework we not considering reasoning tasks over ontologies. proof result consists reducing problem a finitary consequence propositional logic Monteiro-Baaz delta operator, which known be Product FDL first order enjoy finite model property, so cannot restrict interpretations. Thus, obtain result, need codify infinite interpretations using number formulas. Such was conjectured [10], but given subsequently found incorrect. work improved reduction algorithm proposed same provided.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decidability of a Description Logic over Infinite-Valued Product Logic

This paper proves that validity and satisfiability of assertions in the Fuzzy Description Logic based on infinite-valued Product Logic with universal and existential quantifiers (which are non-interdefinable) is decidable when we only consider quasi-witnessed interpretations. We prove that this restriction is neither necessary for the validity problem (i.e., the validity of assertions in the Fu...

متن کامل

A Hybrid Intuitionistic Logic: Semantics and Decidability

An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate properties in a particular place, in some place and in all places. We give a sound and complete Kripke semantics for the logic extended with disjunctive connectives. The extended logic can be seen as an instance of Hybrid IS5. ...

متن کامل

Generalized satisfiability for the description logic ALC

The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSpace-complete, and it is ExpTime-complete in the presence of general concept inclusions. Several fragments of ALC, notably logics in the FL, EL, and DL-Lite families, have an easier satisfiability problem; for some of these logics, satisfiability can be decided in polynomial time. We classify the com...

متن کامل

Reducing OWL Entailment to Description Logic Satisfiability

We show how to reduce ontology entailment for the OWL DL and OWL Lite ontology languages to knowledge base satisfiability in (respectively) the and description logics. This is done by first establishing a correspondence between OWL ontologies and description logic knowledge bases and then by showing how knowledge base entailment can be reduced to knowledge base satisfiability.

متن کامل

Towards Description Logic on Concept Lattices

In this position paper we start with a motivation of our study of modal/description logics with values in concept lattices. Then we give a brief survey of approaches to lattice-valued modal and/or description logics. After that we study some methods of context symmetrization, because the description logic on concept lattices is defined for symmetric co ntexts only. We conclude with a list of pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fuzzy Sets and Systems

سال: 2022

ISSN: ['1872-6801', '0165-0114']

DOI: https://doi.org/10.1016/j.fss.2021.11.013